A matheuristic for AGV scheduling with battery constraints

This paper considers the problem of scheduling automated guided vehicles (AGVs) with battery constraints. Each transport request involves a soft time window, and AGV fleet used to service those requests is heterogeneous diverse set capabilities travel costs. In contrast existing literature, each may require different material handling (such as lift loads, tow or handle loads mounted robot arm), batteries can be recharged partially under consideration critical threshold. The assign charging AGVs, sequence requests, determine their starting times recharging durations AGVs objective minimizing weighted sum tardiness costs AGVs. A mixed-integer linear programming model formulated. We also propose new matheuristic that makes use an adaptive large neighborhood search algorithm program solve industry-size instances. illustrate efficacy our approach industry case study using real-world data.